package com.xgh;

/**
 * @ClassName LinkQuestion
 * @Description
 * @Author xinggh
 * @Date 2020/8/16 23:17
 * @Version 1.0
 **/
public class LinkQuestion {

    /**
     * 合并两个有序链表
     *
     * @param l1
     * @param l2
     * @return
     */
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {

        if (l1 == null) {
            return l2;
        }
        if (l2 == null) {
            return l1;
        }


        ListNode head = new ListNode();
        ListNode cur = head;

        while (l1 != null && l2 != null) {
            if (l1.val > l2.val) {
                cur.next = l2;
                l2 = l2.next;
            } else {
                cur.next = l1;
                l1 = l1.next;
            }
            cur = cur.next;
        }


        cur.next = l1 == null ? l2 : l1;
        return head.next;
    }

}
